package Main2;

import java.util.Scanner;

public class Main16_18 {
    // 字符串通配符
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String t = scan.nextLine();
        String s = scan.nextLine();
        System.out.println();
    }
    public static boolean match(String t, String s) {
        char[] ct = t.toCharArray();
        char[] st = s.toCharArray();
        int lc = ct.length;
        int ls = st.length;
        boolean[][] dp = new boolean[lc + 1][ls + 1];
        dp[0][0] = true;
        for (int i = 0; i <= ls; i++) {
            for (int j = 1; j <= lc; j++) {

            }
        }
        return false;

    }

    // 统计每个月兔子的总数
    public static void main5(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            int m = scan.nextInt();
            System.out.println(num(m));
        }
    }

    private static int num(int m) {
        if (m == 1) return 1;
        else return num(m-1) + num(m -2);
    }

    // 计算某字符出现的次数
    public static void main4(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            String strs = scan.next();
            String str = scan.next();
            int count = 0;
            for (char s : strs.toCharArray()) {
                if (str.equalsIgnoreCase(String.valueOf(s))) {
                    count++;
                }
            }
            System.out.println(count);
        }
    }
    // 杨辉三角的变形
    public static void main3(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            int n = scan.nextInt(); // 行
            int m = 2 * n - 1; // 列
            int[][] arr = new int[n][m];
            arr[0][0] = 1;
            for (int i = 1; i < n; i++) {
                arr[i][0] = arr[i][2*i] = 1;
                for (int j = 1; j < 2*i; j++) {
                    if (j == 1)  arr[i][j] = arr[i-1][j] + arr[i-1][j-1];
                    else arr[i][j] = arr[i-1][j] + arr[i-1][j-1] + arr[i-1][j-2];
                }
            }
            int i = 0;
            for (; i < m; i++) {
                if (arr[n-1][i] % 2 == 0) {
                    System.out.println(i + 1);
                    break;
                }
            }
            if (i == m) System.out.println(-1);
        }
    }

    // 完全数计算
    public static void main2(String[] args) {
        Scanner scan = new Scanner(System.in);
        while (scan.hasNext()) {
            int n = scan.nextInt();
            int count = 0;
            for (int i = 2; i <= 100; i++) {
                int sum = 0;
                for (int j = 2; j * j < i; j++) {
                    if (i % j == 0) {
                        if (i % j == j) {
                            sum += j;
                        } else {
                            sum += j + i/j;
                        }
                    }
                }
                if (sum + 1 == i) {
                    count++;
                }
            }
            System.out.println(count);
        }
    }

    // 扑克牌大小
    public static void main1(String[] args) {
        Scanner scan = new Scanner(System.in);
        String str = scan.nextLine();
        String[] strs = str.split("-");
        String[] p1 = strs[0].split(" ");
        String[] p2 = strs[1].split(" ");
        String p = "34567891JQKA2";
        if (strs[0].equals("joker JOKER") || strs[1].equals("joker JOKER")) {
            System.out.println("joker JOKER");
        } else if (p1.length == p2.length) {
            // 长度相等就比较第一张牌即可
            if (p.indexOf(p1[0].substring(0, 1)) > p.indexOf(p2[0].substring(0, 1))) {
                System.out.println(strs[0]);
            } else {
                System.out.println(strs[1]);
            }
        } else if (p1.length == 4) {
            System.out.println(strs[0]);
        } else if (p2.length == 4) {
            System.out.println(strs[2]);
        } else {
            System.out.println("ERROR");
        }
    }
}
